Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Optimized routing algorithm based on cooperative communication of cluster parent set for low power and lossy network
YAO Yukun, LIU Jiangbing, LI Xiaoyong
Journal of Computer Applications    2017, 37 (5): 1300-1305.   DOI: 10.11772/j.issn.1001-9081.2017.05.1300
Abstract426)      PDF (995KB)(404)       Save
To deal with the problems that the routing algorithm based on Collaborative communication of Cluster Parent (CRPL) for Low Power and Lossy Network (LLN) can't balance the energy consumption of the node and maximize the extension of the lifetime for network efficiently due to take no account of the residual energy of the node, a high-efficient routing algorithm based on collaborative communications of cluster parent set HE-CRPL was proposed. The proposed algorithm chiefly carried out three optimization schemes. Firstly, the wireless link quality and the residual energy of node could be considered during the cluster parent selection. Secondly, the wireless link quality and the Expected LifeTime (ELT) of cluster parent node were combined while estimating the priority of the cluster parent node and selecting the optimal cluster parent set. Thirdly, the cluster parent nodes were notified the priority list by Destination Advertisement Object (DAO) message during the initialization of the network topology. The simulation results show that, compared with the CRPL algorithm, the performance of the HE-CRPL algorithm is improved obviously in prolonging the network lifetime, increasing the packet delivery success rate and reducing the number of packet retransmissions, and that the lifetime of network prolonging by more than 18.7% and the number of retransmissions decrease by more than 15.9%.
Reference | Related Articles | Metrics
High efficiency medium access control protocol based on cooperative network coding
YAO Yukun, LI Xiaoyong, REN Zhi, LIU Jiangbing
Journal of Computer Applications    2017, 37 (10): 2748-2753.   DOI: 10.11772/j.issn.1001-9081.2017.10.2748
Abstract633)      PDF (992KB)(423)       Save
The transmission energy consumption of nodes does not be considered in the exiting Network Coding Aware Cooperative MAC (NCAC-MAC) protocol for Ad Hoc Network, and the control message sent by the candidate cooperative relay node can not make the other candidate nodes which are not in the communication range give up competition, thus causing collision. To deal with those problems, a high efficiency Medium Access Control (MAC) protocol based on cooperative network coding High Efficiency MAC protocol based on Cooperative Network Coding (HECNC-MAC) was proposed. Three optimization schemes were carried out by the protocol. Firstly, candidate cooperative relay node need to prejudge whether the destionation can decode the packet, so as to reduce the number of competitive relay nodes and ensure that the destination node could be successfully decoded. Secondly, the transmission energy consumption of nodes should be synthetically considered when selecting the cooperative relay node. Finally, the Eager To Help (ETH) message is canceled, and the destination node sents conformation message through pseudo-broadcast. Theoretical analysis and simulation results show that in the comparison experiments with Carrier Sense Multiple Access (CSMA), Phoenix and NCAC-MAC protocols, the transmission energy consumption of nodes and the end-to-end delay of date packages can be effectively reduced, and the network throughput can be improved by HECNC-MAC.
Reference | Related Articles | Metrics
High-efficient community-based message transmission scheme in opportunistic network
YAO Yukun, YANG Jikai, LIU Wenhui
Journal of Computer Applications    2015, 35 (9): 2447-2452.   DOI: 10.11772/j.issn.1001-9081.2015.09.2447
Abstract369)      PDF (894KB)(374)       Save
To deal with the problems that message-distributed tasks are backlogged by nodes in the inner community and active nodes are blindly selected to transmit message in the Community-based Message Transmission Scheme in Opportunistic Social Network (OSNCMTS), a High-Efficient Community-based Message Transmission Scheme in opportunistic network (HECMTS) was proposed. In HECMTS, firstly, communities were divided by Extremal Optimization (EO) algorithm and the corresponding community matrices were distributed to nodes; secondly, the copies of message were assigned based on the community matrices and the success rate of data packets to destination nodes; finally, the active nodes' information was collected by the opportunities of active nodes' back and forth in different communities, then the suitable nodes were selected to finish message transmitting between communities by querying the active node information. The simulation results show that routing overhead in HECMTS is decreased by at least 19% and the average end-to-end delay is decreased by at least 16% compared with OSNCMTS.
Reference | Related Articles | Metrics